Critical phenomena in a collective computation algorithm for combinatorial optimization problems
نویسندگان
چکیده
منابع مشابه
A New Optimization Algorithm For Combinatorial Problems
Combinatorial optimization problems are those problems that have a finite set of possible solutions. The best way to solve a combinatorial optimization problem is to check all the feasible solutions in the search space. However, checking all the feasible solutions is not always possible, especially when the search space is large. Thus, many meta-heuristic algorithms have been devised and modifi...
متن کاملCombinatorial Optimization Problems for Which Almostevery Algorithm
Consider a class of optimization problems for which the cardinality of the set of feasible solutions is m and the size of every feasible solution is N. We prove in a general probabilistic framework that the value of the optimal solution and the value of the worst solution are asymptotically almost surely (a.s.) the same provided log m = o(N) as N and m become large. This result implies that for...
متن کاملA Research of Evolutionary Computation for Combinatorial Optimization Problems
II complexity of the algorithm is greatly reduced especially to large scale problems. Applying this application of FSO on large number of instances and comparing with GA, the experiments results shows that these designs could improve the effectiveness, convergence rate and stability for FSO. Since various optimization algorithms take the different speed of operation or evolutionary (iteration) ...
متن کاملA Cross-Entropy Based Algorithm for Combinatorial Optimization Problems
Cross Entropy has been recently applied to combinatorial optimization problems with promising results. This paper proposes a new cross-entropy based algorithm for monotonic integer programming problems with knapsack-type constraints. We show how the metaheuristic method can be adapted to tackle constrained problems, provided that some basic mathematical properties are enforced. Furthermore, som...
متن کاملA Dual-based Combinatorial Algorithm for Solving Cyclic Optimization Problems
This paper describes Patent Number U.S. 8,046,316 B2, titled “Cyclic Combinatorial Method and System”, issued by the US Patents and Trademarks Office on October 25, 2011. The patent is based on a combinatorial algorithm to solve cyclic optimization problems. First, the algorithm identifies cyclically distinct solutions of such problems by enumerating cyclically distinct combinations of the basi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1999
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(99)00159-5